منابع مشابه
A Scalable Parallel Block Algorithm for Band Cholesky Factorization
In this paper, we present an algorithm for computing the Cholesky factorization of large banded matrices on the IBM distributed memory parallel machines. The algorithm aims at optimizing the single node performance and minimizing the communication overheads. An important result of our paper is that the proposed algorithm is strongly scalable. As the bandwidth of the matrix increases, the number...
متن کاملTask Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout
We introduce a task-parallel algorithm for sparse incomplete Cholesky factorization that utilizes a 2D sparse partitioned-block layout of a matrix. Our factorization algorithm follows the idea of algorithms-by-blocks by using the block layout. The algorithm-byblocks approach induces a task graph for the factorization. These tasks are inter-related to each other through their data dependences in...
متن کاملParallel Cholesky Factorization of a Block Tridiagonal Matrix
In this paper we discuss the parallel implementation of the Cholesky factorization of a positive definite symmetric matrix when that matrix is block tridiagonal. While parallel implementations for this problem, and closely related problems like the factorization of banded matrices, have been previously reported in the literature, those implementations dealt with the special cases where the bloc...
متن کاملParallel Dense Cholesky Factorization
This paper explores performance issues for several prominent approaches to parallel dense Cholesky fattotition. The primary focus is on issues that arise when blocking techniques are integrated into parallel factorization approaches to improve data reuse in the memory hierarchy. We f&t consider panel-oriented approaches, where sets of contiguous columns are manipulated as single units. These me...
متن کاملParallel Sparse Cholesky Factorization
Sparse matrix factorization plays an important role in many numerical algorithms. In this paper we describe a scalable parallel algorithm based on the Multifrontal Method. Computational experiments on a Parsytec CC system with 32 processors show that large sparse matrices can be factorized in only a few seconds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 1992
ISSN: 0168-9274
DOI: 10.1016/0168-9274(92)90054-h